A C++ Reasoner for the Description Logic DL-4X(D)
نویسندگان
چکیده
We present an ongoing implementation of a KE-tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic DL〈4LQSR,×〉(D) (shortly DL D ). The reasoner checks the consistency of DL D -knowledge bases (KBs) represented in set-theoretic terms. It is implemented in C++ and supports DL D -KBs serialized in the OWL/XML format. To the best of our knowledge, this is the first attempt to implement a reasoner for the consistency checking of a description logic that is represented via a fragment of set theory that can also classify standard OWL ontologies.
منابع مشابه
A \textsf{C++} reasoner for the description logic $\shdlssx$
We present an ongoing implementation of a KE-tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic DL〈4LQSR,×〉(D) (shortly DL D ). The reasoner checks the consistency of DL D -knowledge bases (KBs) represented in set-theoretic terms. It is implemented in C++ and supports DL D -KBs serialized in the OWL/XML format. To the best of our...
متن کاملLiFR: A Lightweight Fuzzy DL Reasoner
In this paper we present LiFR, a lightweight DL reasoner capable of performing in resource-constrained devices, that implements a fuzzy extension of Description Logic Programs. Preliminary evaluation against two existing fuzzy DL reasoners and within a real-world use case has shown promising results.
متن کاملDReW: a Reasoner for Datalog-rewritable Description Logics and DL-Programs
Nonmonotonic dl-programs provide a loose integration of Description Logic (DL) ontologies and Logic Programming (LP) rules with negation, where a rule engine can query an ontology with a native DL reasoner. However, even for tractable dl-programs, the overhead of an external DL reasoner might be considerable. Datalog-rewritable DL ontologies, such as LDL, can be rewritten to Datalog programs, s...
متن کاملKnowledge-Management with OWL and F-Logic: A Combination of Description Logic Reasoning with F-Logic Rules
This thesis proposes an approach to combine the abilities of Description Logic reasoning with the expressiveness of F-Logic rules. Description Logics (DL) play a key role in ontology modeling for the Semantic Web, most notably as the underlying logic of OWL DL. However, their expressiveness is limited, in particular in conjunction with efficient reasoning. Furthermore, the logic programming par...
متن کاملPellet System Description
The description logic SHOIN (D) has attracted considerable interest as the foundation of the W3C standard Web Ontology Language variant, OWL-DL. Pellet is a sound and complete tableau reasoner for SHOIN (D) and incorporates a number of key features such as conjunctive ABox query, axiom pinpointing, rules, E-connection reasoning, and novel optimizations for nominals. In this paper we summarize P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017